Efficient Key Generation for Dynamic Blom's Scheme

نویسنده

  • Divya Harika Nagabhyrava
چکیده

The need for secure communication between the nodes in a network has led to the development of various key distribution schemes. Blom’s scheme is a prominent key exchange protocol used for sensor and wireless networks, but its shortcomings include large computation overhead and memory cost. In this paper, we propose an efficient key management scheme by generating new public and private keys. We also focus on making Blom’s scheme dynamic by randomly changing the secret key that is generated by the base station and we propose the use of the mesh array for matrix multiplication for reducing the computation overhead. INTRODUCTION Recent improvements in the field of electronic and computer technologies, have paved the way for the proliferation of wireless sensor networks (WSN).These sensors are used to collect environmental information and they have been considered for various purposes, including security monitoring, target tracking and research activities in hazardous environments. Encryption, authentication, confidentiality and key management are the main aspects to focus on to achieve security in wireless sensor networks. Different key management schemes have been developed for authentication and confidentiality purposes. Symmetric algorithm base key management protocols are used in wireless sensor networks because key management protocols based on public key cryptography are inefficient due to resource limitations. Blom’s scheme [1] and others related to it [2]-[10] to it are often used for secure sensor communication. Issues that need to be considered include key management [13]-[17] and randomness of sequences [18]-[23]. In this paper we review general considerations and then propose our scheme for dynamic change of keys. We present results of our simulations. GENERAL CONSIDERATIONS The main challenges of the sensor nodes are as follows:  The nodes are solely responsible for any change in the configuration as there would be no human intervention once the sensor network is deployed.  There is only a finite source of energy as the nodes are not connected to any other energy source. Hence, communication should be minimized.  It is required that a sensor network system be adaptable to changing connectivity as well as changing environmental stimuli.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An efficient certificateless signcryption scheme in the standard model

Certificateless public key cryptography (CL-PKC) is a useful method in order to solve the problems of traditional public key infrastructure (i.e., large amount of computation, storage and communication costs for managing certificates) and ID-based public key cryptography (i.e., key escrow problem), simultaneously. A signcryption scheme is an important primitive in cryptographic protocols which ...

متن کامل

An Efficient Genetic Agorithm for Solving the Multi-Mode Resource-Constrained Project Scheduling Problem Based on Random Key Representation

In this paper, a new genetic algorithm (GA) is presented for solving the multi-mode resource-constrained project scheduling problem (MRCPSP) with minimization of project makespan as the objective subject to resource and precedence constraints. A random key and the related mode list (ML) representation scheme are used as encoding schemes and the multi-mode serial schedule generation scheme (MSSG...

متن کامل

Key Predistribution Scheme Using Affine Planes and Blom’s Scheme

In this paper we discuss the problem of designing a key predistribution scheme (KPS). We present a composite deterministic KPS based on “multiple key spaces” construction principle. As building blocks for it we take a KPS generated by affine planes and the well-known Blom’s scheme. The analysis of the resulting scheme shows its high global connectivity and resilience against nodes’ compromise. ...

متن کامل

An efficient secure channel coding scheme based on polar codes

In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...

متن کامل

Computational Analysis of Modified Blom's Scheme

To achieve security in wireless sensor networks, it is important to be able to encrypt and authenticate messages sent among sensor nodes. Due to resource constraints, achieving such key agreement in wireless sensor networks is nontrivial. Blom’s scheme is a symmetric key exchange protocol used in cryptography. But the concerns with Blom’s scheme are the complexity involved in computation as wel...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1410.7340  شماره 

صفحات  -

تاریخ انتشار 2014